Trace- and Failure-Based Semantics for Bounded Responsiveness

We study open systems modeled as Petri nets with an interface for asynchronous communication with other open systems. As a minimal requirement for successful communication, we investigate bounded responsiveness, which guarantees that an open system and its environment always have the possibility to communicate, while the number of pending messages never exceeds a previously known bound. Bounded responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for accordance. As this relation turns out not to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in this relation, using a variation of should testing, and show decidability.